Suns, moons, and quasi-polyhedra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Quadratic Quasi-polyhedra

This paper introduces two fundamental families of ‘quasipolyhedra’ — polyhedra with a countably infinite number of facets — that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, a...

متن کامل

Quasi-semi-metrics, Oriented Multi-cuts and Related Polyhedra

The notions of directed distances, quasi-metrics and oriented multi-cuts are generalizations of the notions of distances, metrics and cuts, which are central objects in graph theory and combinatorial optimization. Define a quasi-semi-metric on X as a function d from X2 to R+, such that for all x, y, z ∈ X , d(x, y) ≥ 0, d(x, x) = 0, and d(x, y) ≤ d(x, z) + d(z, y). If the first inequality is st...

متن کامل

Supramolecular NanoStamping (SuNS)

When a useful device is developed, it always requires a mass-production technique to industrialize it. In the era of nano/biotechnology, the development of printing techniques has not followed the speed of the inventions of novel devices. One of the main challenges is handling at the same time the resolution and the chemical complexity of these nano/biodevices. Here a new stamping technique, Su...

متن کامل

Elliptical instability in terrestrial planets and moons

Context. The presence of celestial companions means that any planet may be subject to three kinds of harmonic mechanical forcing: tides, precession/nutation, and libration. These forcings can generate flows in internal fluid layers, such as fluid cores and subsurface oceans, whose dynamics then significantly differ from solid body rotation. In particular, tides in non-synchronized bodies and li...

متن کامل

Recursively Arbitrarily Vertex-decomposable Suns

A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilber...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1972

ISSN: 0021-9045

DOI: 10.1016/0021-9045(72)90073-1